package linkedlist.remove;

import java.util.*;

class asdas {
    static int[] temp;
    static int cnt = 0;
    public static void main(String[] args) {
        test();
    }

    public static void test() {
        Scanner input = new Scanner(System.in);
        // code here
        int q = 0;
        int n = input.nextInt();
        int[] nums = new int[n];
        for (int i=0;i<nums.length;i++) {
            nums[i]=input.nextInt();
        }

        int m = input.nextInt();
        String[] rtn = new String[m];

        //core
        for (int i = 0; i < m; i++) {
            int l=input.nextInt();
            int r=input.nextInt();
            reverse(nums, l - 1, r - 1);
//            for (int num : nums) {
//                System.out.print(num+" ");
//            }
//            int res=0;

            int res = reversePairs(nums);
            cnt=0;
//            for(int j=0;j<nums.length;j++){
//                for(int k=j+1;k<nums.length;k++){
//                    if(nums[j]>nums[k]){
//                        res++;
//                    }
//                }
//            }
            System.out.println(res % 2 == 0 ? "even" : "odd");
        }
            input.close();
    }




    public static int reversePairs(int[] nums) {
        int n = nums.length;
        temp = new int[n];
        mergeSort(nums, 0, n - 1);
        return cnt;
    }

    private static void mergeSort(int[] arr, int left, int right) {
        if (left >= right) {
            return;
        }
        // 像不像二叉树的后序遍历？
        int mid = (right - left) / 2 + left;
        // 递 => 将数组分割成不可再分的小块
        mergeSort(arr, left, mid);
        mergeSort(arr, mid + 1, right);
        // 归 => 逐步合并已完成排序的左右小块
        merge(arr, left, mid, right);
    }

    private static void merge(int[] arr, int left, int mid, int right) {
        // 复制一下，准备归并
        for (int i = left; i <= right; i++) {
            temp[i] = arr[i];
        }

        // 修改原数组，归并 temp
        int i = left, j = mid + 1, k = left;
        while (i <= mid && j <= right) {
            if (temp[i] > temp[j]) {
                arr[k] = temp[j++];
                // mid 前有多少个 temp[j] 比当前 temp[i] 小
                cnt += mid - i + 1;
            } else {
                arr[k] = temp[i++];
            }
            k++;
        }

        while (i <= mid) {
            arr[k++] = temp[i++];
        }

        while (j <= right) {
            arr[k++] = temp[j++];
        }
    }

        public static void reverse ( int[] nums, int i, int j){
            int left = i, right = j;
            for (int k = i; k <= (i + j) / 2; k++) {
                int temp = nums[left];
                nums[left++] = nums[right];
                nums[right--] = temp;
            }
        }
}
